An approximation algorithm for counting contingency tables
نویسندگان
چکیده
منابع مشابه
An approximation algorithm for counting contingency tables
We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column sums C = (c1, . . . , cn). We define smooth margins (R,C) in terms of the typical table and prove that for such margins the algorithm has quasi-polynomial NO(lnN) complexity, where N = r1 + · · · + rm = c1 + · · · + cn. Various ...
متن کاملApproximate Counting Scheme for m X n Contingency Tables
In this paper, we propose a new counting scheme for m × n contingency tables. Our scheme is a modification of Dyer and Greenhill’s scheme for two rowed contingency tables [5]. We can estimate not only the sizes of error, but also the sizes of the bias of the number of tables obtained by our scheme, on the assumption that we have an approximate sampler. key words: counting, approximation, #P-com...
متن کاملPolynomial-time counting and sampling of two-rowed contingency tables
In this paper a Markov chain for contingency tables with two rows is defined. The chain is shown to be rapidly mixing using the path coupling method. We prove an upper bound for the mixing time of the chain. The upper bound is quadratic in the number of columns and linear in the logarithm of the table sum. By considering a specific problem, we prove a lower bound for the mixing time of the chai...
متن کاملSampling and Counting Contingency Tables Using Markov Chains
In this paper we present an overview of contingency tables, provide an introduction to the problems of almost uniform sampling and approximate counting, and show recent results achieved through the use of Markov chains. We focus specifically on contingency tables with two rows, since as of this time little progress has been made in achieving reasonable bounds on arbitrarily sized contingency ta...
متن کاملPolynomial time perfect sampling algorithm for two-rowed contingency tables
This paper proposes a polynomial time perfect (exact) sampling algorithm for 2 × n contingency tables. The algorithm is based on monotone coupling from the past (monotone CFTP) algorithm. The expected running time is bounded by O(n lnN) where n is the number of columns and N is the total sum of all entries.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2010
ISSN: 1042-9832
DOI: 10.1002/rsa.20301